Formally-Proven Kosaraju’s algorithm
نویسنده
چکیده
This notes explains how the Kosaraju’s algorithm that computes the strong-connected components of a directed graph has been formalised in the Coq prover using the SSReflect extension.
منابع مشابه
Depth-first search and strong connectivity in Coq
Using Coq, we mechanize Wegener’s proof of Kosaraju’s linear-time algorithm for computing the strongly connected components of a directed graph. Furthermore, also in Coq, we define an executable and terminating depth-first search algorithm.
متن کاملStructurally Cyclic Petri Nets
A Petri net is structurally cyclic if every configuration is reachable from itself in one or more steps. We show that structural cyclicity is decidable in deterministic polynomial time. For this, we adapt the Kosaraju’s approach for the general reachability problem for Petri nets.
متن کاملA Minimal Periods Algorithm with Applications
Kosaraju in “Computation of squares in a string” briefly described a linear-time algorithm for computing the minimal squares starting at each position in a word. Using the same construction of suffix trees, we generalize his result and describe in detail how to compute in O(k|w |)-time the minimal kth power, with period of length larger than s, starting at each position in a word w for arbitrar...
متن کاملOn the Futility of Blind Search
This paper might have been subtitled An algorithmicist looks at no free lunch We use simple adversary arguments to redevelop and explore some of the no free lunch NFL theorems and perhaps extend them a lit tle A second goal is to clarify the relationship of NFL theorems to algorithm theory In particular we claim that NFL puts much weaker restrictions on the claims that an evolutionary algorithm...
متن کاملOn the Futility of Blind SearchJoseph
This paper might have been subtitled \An algorithmicist looks at no free lunch." We use simple adversary arguments to redevelop and explore some of the no free lunch (NFL) theorems and perhaps extend them a little. A second goal is to clarify the relationship of NFL theorems to algorithm theory. In particular we claim that NFL puts much weaker restrictions on the claims that an evolutionary alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017